Preference Construction for Database Querying
ثبت نشده
چکیده
vi
منابع مشابه
ReqFlex: Fuzzy Queries for Everyone
In this demonstration we present a complete fuzzy-set-based approach to preference queries that tackles the two main questions raised by the introduction of flexibility and personalization when querying relational databases: i) how to efficiently execute preference queries? and, ii) how to help users define preferences and queries? As an answer to the first question, we propose PostgreSQL f, a ...
متن کاملDeveloping a BIM-based Spatial Ontology for Semantic Querying of 3D Property Information
With the growing dominance of complex and multi-level urban structures, current cadastral systems, which are often developed based on 2D representations, are not capable of providing unambiguous spatial information about urban properties. Therefore, the concept of 3D cadastre is proposed to support 3D digital representation of land and properties and facilitate the communication of legal owners...
متن کاملOptimization of Preference Queries with Multiple Constraints
Nowadays, the efficient integration of preference querying into standard database technology is an important issue. In some instances, preference queries challenge traditional query processing and optimization. In this paper we study preference database queries involving hard constraints over multiple attributes belonging to several relations. The main bottleneck for such queries is the computa...
متن کاملDeveloping Preference Band Model to Manage Collective Preferences
Discovering user preference is an important task in various database applications, such as searching product information and rating goods and services. Previous work addressing user preference in databases either assumes that users are able to formulate explicit preference criteria when querying, which may not be feasible in reality, or develops mining techniques to discover users’ implicit pre...
متن کاملMonotonic and Nonmonotonic Preference Revision
We study here preference revision, considering both the monotonic case where the original preferences are preserved and the nonmonotonic case where the new preferences may override the original ones. We use a relational framework in which preferences are represented using binary relations (not necessarily finite). We identify several classes of revisions that preserve order axioms, for example ...
متن کامل